MPSS: Mobile Proactive Secret Sharing
ثبت نشده
چکیده
This paper describes MPSS, a new proactive secret sharing protocol that provides mobility. Rather than requiring that the group of shareholders remain the same in every epoch, MPSS allows the membership of the group to change arbitrarily in each epoch. Mobility provides a needed methodology for a system administrator to use to determine group membership: identify a set of “fresh” nodes, and move the secret shares to them. In addition, MPSS allows for an increase or decrease of the threshold at each epoch. MPSS is the first known efficient protocol for mobile proactive secret sharing in asynchronous networks. We present this protocol as a practical solution to the problem of long-term protection of a secret in a realistic network.
منابع مشابه
Mobile Proactive Secret Sharing in Cloud Computing
This research paper introduces a scheme to secure any secret value in cloud network by Mobile Proactive Secret Sharing (MPSS). This is an extension of proactive secret sharing, where contributing parties of a network hold the shares of a secret value. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareho...
متن کاملProactive Bai’s Secret Sharing Scheme for AOMDV Routing Protocol for Secured Communication in MANET
-The amount of applications in Wireless networks is developing continuously. And hence the need for security in wireless communication is also developing constantly with the development of Wireless communication particularly in MANET. Security is of a great concern in the present wireless communication. It is essential to provide security to the network from the attackers and their security att...
متن کاملOn Proactive Secret Sharing Schemes
This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restriction to the adversary. We first investigate the approach of using commitment to 0 in the renewal phase in order to renew the player’s shares. In the considered model some well known computationally secure protocols (which use th...
متن کاملOn Proactive Verifiable Secret Sharing Schemes
This paper investigates the security of Proactive Secret Sharing Schemes. We first consider the approach of using commitment to 0 in the renewal phase in order to refresh the player’s shares and we present two types of attacks in the information theoretic case. Then we prove the conditions for the security of such a proactive scheme. Proactivity can be added also using re-sharing instead of com...
متن کاملTolerating Generalized Mobile Adversaries in Secure Multiparty Computation
We study a distributed adversarial model of computation in which the faults are non-stationary and can move through the network (like viruses) as well as non-threshold (there is no specific bound on the number of corrupted players at any given time). We show how to construct multiparty protocols that are perfectly secure against such generalized mobile adversaries. The key element in our soluti...
متن کامل